Exploiting orbits in symmetric ILP

نویسنده

  • François Margot
چکیده

This paper describes components of a branch-and-cut algorithm for solving integer linear programs having a large symmetry group. It describes an isomorphism pruning algorithm and variable setting procedures using orbits of the symmetry group. Pruning and orbit computations are performed by backtracking procedures using a Schreier-Sims table for representing the symmetry group. Applications to hard set covering problems, generation of covering designs and error correcting codes are given.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Performance Impact of Exploiting Branch ILP with Tree Representation of ILP Code

Modern single-CPU microprocessors exploit instruction-level parallelism (ILP) by deriving their performance advantage mainly from parallel execution of ALU and memory instructions within a single clock cycle. This performance advantage obtained by exploiting data ILP is severely offset by sequential execution of conditional branches, especially in branch-intensive non-numerical code. Consequent...

متن کامل

Bifurcations from one-parameter families of symmetric periodic orbits in reversible systems

We study bifurcations from one-parameter families of symmetric periodic orbits in reversible systems and give simple criteria for subharmonic symmetric periodic orbits to be born from the one-parameter families. Our result is illustrated for a generalization of the Hénon-Heiles system. In particular, it is shown that there exist infinitely many families of symmetric periodic orbits bifurcating ...

متن کامل

Shared memory multiprocessors

The hardware evolution has reached the point where it becomes extremely difficult to further improve the performance of superscalar processors by either exploiting more instruction-level parallelism (ILP) or using new semiconductor technologies. The effort to increase processor performance by exploiting ILP follows the law of diminishing returns: new, more complex optimisations tend to cost mor...

متن کامل

Periodic Orbits of a Collinear Restricted Three Body Problem

In this paper we study symmetric periodic orbits of a collinear restricted three body problem, when the middle mass is the largest one. These symmetric periodic orbits are obtained from analytic continuation of symmetric periodic orbits of two collinear two body problems.

متن کامل

Computing Orbits of Minimal Parabolic k-subgroups Acting on Symmetric k-varieties

The orbits of a minimal parabolic k-subgroup acting on a symmetric k-variety are essential to the study of symmetric k-varieties and their representations. This paper gives an algorithm to compute these orbits and most of the combinatorial structure of the orbit decomposition. There are several ways to describe these orbits, see for example [22, 28, 35]. Fundamental in all these descriptions ar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Program.

دوره 98  شماره 

صفحات  -

تاریخ انتشار 2003